AT-MFCGA: An Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm for Evolutionary Multitasking
نویسندگان
چکیده
• An adaptive and transfer guided metaheuristic is proposed for Evolutionary Multitasking. Synergies between tasks are analyzed along the search in a dynamic way. 4 different combinatorial optimization problems have been considered. 11 multitasking scenarios solved comprised by 5 to 20 instances. Proposed AT-MFCGA compared with MFEA, MFEA-II MFCGA. Transfer Optimization an incipient research area dedicated solving multiple simultaneously. Among approaches that can address this problem effectively, Multitasking resorts concepts from Computation solve within single process. In paper we introduce novel algorithm deal environments coined as Adaptive Transfer-guided Multifactorial Cellular Genetic Algorithm (AT-MFCGA). relies on cellular automata implement mechanisms order exchange knowledge among under consideration. Furthermore, our approach able explain itself synergies were encountered exploited during search, which helps us understand interactions related tasks. A comprehensive experimental setup designed assess compare performance of other renowned alternatives (MFEA MFEA-II). Experiments comprise composed instances problems, yielding largest discrete environment date. Results conclusive regard superior quality solutions provided respect rest methods, complemented quantitative examination genetic transferability throughout
منابع مشابه
An Adaptive Evolutionary Algorithm for Numerical Optimization
In this paper, a normalized oating point representation has been used for making it be possible to design biotechnical genetic operators as well as to apply some genetic operators like inversion. To improve the adaptation of evolutionary algorithms and avoid the biases which may exist in some genetic operators, we have designed and applied several kinds of genetic operators with some probabilit...
متن کاملAn Adaptive Simplex Genetic algorithm
In this paper, based on our previous research on simplex genetic algorithm, we put forward an adaptive approach for the self-adaptation of the percentage of simplex. According to the average fitness of those individuals generated by simplex operator in a certain generation, a set of rules is designed to adaptively adjust the simplex percentage within a certain range. This helps the algorithm al...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملAn Adaptive Evolutionary Algorithm Combining Evolution Strategy and Genetic Algorithm (Application of Fuzzy Power System Stabilizer)
The research of power system stabilizer (PSS) for improving the stability of power system has been conducted from the late 1960's. Conventionally lead-lag controller has been widely used as PSS. Root locus and Bode plot to determine the coefficient of lead-lag controller (Yu, 1983; Larsen and Swann, 1981; Kanniah et al., 1984), pole-placement and eigenvalue control (Chow & Sanchez-Gasca, 1989; ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2021.05.005